Joint Source/Channel Coding and MAP Decoding of Arithmetic Codes
نویسندگان
چکیده
منابع مشابه
Soft and Joint Source-Channel Decoding of Quasi-Arithmetic Codes
The issue of robust and joint source-channel decoding of quasi-arithmetic codes is addressed. Quasi-arithmetic coding is a reduced precision and complexity implementation of arithmetic coding. This amounts to approximating the distribution of the source. The approximation of the source distribution leads to the introduction of redundancy that can be exploited for robust decoding in presence of ...
متن کاملMap Decoding of Arithmetic Codes with a Forbidden Symbol
In this paper, a novel maximum a posteriori (MAP) technique for the decoding of arithmetic codes in the presence of transmission errors is presented. Arithmetic codes with a forbidden symbol and trellis search techniques are employed in order to estimate the best transmitted codeword. The viability of the proposed approach is demonstrated in the binary symmetric channel case in terms of both pe...
متن کاملتجزیه و تحلیل عملکرد کدهای کانولوشنال تعریف شده در میدان حقیقی در کانال فیدینگ و در حضور نویز کوانتیزاسیون
Channel coding is one of the techniques used for suppression of fading and channel noise effects. Most of the researches on channel codes have been focused on the codes which are defined on Galois fields. Since two decades ago, using channel codes defined on Real and Complex fields has been considered for joint sourcechannel coding in multimedia transmission; but most of the works have focused ...
متن کاملCoding and Decoding of the Matroid Codes
Encoder and decoder algorithm of the matroid burst errors correcting code is defined. Constant multiplications is considered, and are shown the circuits implemented in the XOR-basis that drastically reduces the encoder/decoder complexity. The features of the matroid code encoding/decoding are analysed.
متن کاملFixed-Point MAP Decoding of Channel Codes
This paper describes the fixed-point model of the maximum a posteriori (MAP) decoding algorithm of turbo and low-density parity-check (LDPC) codes, the most advanced channel codes adopted by modern communication systems for forward error correction (FEC). Fixed-point models of the decoding algorithms are developed in a unified framework based on the use of the Bahl-Cocke-Jelinek-Raviv (BCJR) al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2005
ISSN: 0090-6778
DOI: 10.1109/tcomm.2005.849690